The strong interaction limit of continuous-time weakly self-avoiding walk

نویسندگان

  • David C. Brydges
  • Antoine Dahlqvist
  • Gordon Slade
چکیده

The strong interaction limit of the discrete-time weakly self-avoiding walk (or Domb–Joyce model) is trivially seen to be the usual strictly self-avoiding walk. For the continuous-time weakly self-avoiding walk, the situation is more delicate, and is clarified in this paper. The strong interaction limit in the continuous-time setting depends on how the fugacity is scaled, and in one extreme leads to the strictly self-avoiding walk, in another to simple random walk. These two extremes are interpolated by a new model of a self-repelling walk that we call the “quick step” model. We study the limit both for walks taking a fixed number of steps, and for the two-point function. 1 Domb–Joyce model: discrete time The discrete-time weakly self-avoiding walk, or Domb–Joyce model [6], is a useful adaptation of the strictly self-avoiding walk that continues to be actively studied [1]. It is defined as follows. For simplicity, we restrict attention to the nearest-neighbour model on Zd , although a more general formulation is easy to obtain. David C. Brydges Department of Mathematics, University of British Columbia, Vancouver, BC, Canada V6T 1Z2, e-mail: [email protected] Antoine Dahlqvist DMA–Ecole Normale Supérieure, 45 rue d’Ulm, 75230 Paris Cedex 5, France, e-mail: [email protected] Gordon Slade Department of Mathematics, University of British Columbia, Vancouver, BC, Canada V6T 1Z2, e-mail: [email protected]

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Critical correlation functions for the 4-dimensional weakly self-avoiding walk and n-component |φ| model

We extend and apply a rigorous renormalisation group method to study critical correlation functions, on the 4-dimensional lattice Z4, for the weakly coupled n-component |φ|4 spin model for all n ≥ 1, and for the continuous-time weakly self-avoiding walk. For the |φ|4 model, we prove that the critical two-point function has |x|−2 (Gaussian) decay asymptotically, for n ≥ 1. We also determine the ...

متن کامل

Continuous time ‘ true ’ self - avoiding random walk on Z

We consider the continuous time version of the 'true' or 'myopic' self-avoiding random walk with site repulsion in 1d. The Ray – Knight-type method which was applied in [15] to the discrete time and edge repulsion case, is applicable to this model with some modifications. We present a limit theorem for the local time of the walk and a local limit theorem for the displacement.

متن کامل

Weak Interaction Limits for One-dimensional Random Polymers

In this paper we present a new and flexible method to show that, in one dimension, various self-repellent random walks converge to self-repellent Brownian motion in the limit of weak interaction after appropriate space-time scaling. Our method is based on cutting the path into pieces of an appropriately scaled length, controlling the interaction between the different pieces, and applying an inv...

متن کامل

A Class of Weakly Self-avoiding Walks

We define a class of weakly self-avoiding walks on the integers by conditioning a simple random walk of length n to have a p-fold self-intersection local time smaller than nβ, where 1 < β < (p+1)/2. We show that the conditioned paths grow of order nα, where α = (p− β)/(p− 1), and also prove a coarse large deviation principle for the order of growth.

متن کامل

An expansion for self-interacting random walks

We derive a perturbation expansion for general interacting random walks, where steps are made on the basis of the history of the path. Examples of models where this expansion applies are reinforced random walk, excited random walk, the true (weakly) self-avoiding walk and loop-erased random walk. We use the expansion to prove a law of large numbers and central limit theorem for two models: (i) ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011